Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling

نویسندگان

چکیده

Pre-runtime scheduling of large-scale electronic systems, as those in modern aircraft, can be computationally challenging. In this paper, we study a distributed integrated modular avionic system practical relevance where the includes to assign communication messages time slots and sequence tasks on modules. For problem, challenge is huge number scheduled intricate interaction between task scheduling. We present method based Logic-Based Benders Decomposition (LBBD) solve problem. master formulated mixed-integer program, are assigned subproblem, constraint scheduled. Our LBBD scheme accelerated by using cut strengthening, subproblem relaxation, components for preprocessing initialisation scheme. The strengthening kind that systematically investigates subsets variables include solving additional subproblems. To further enhance efficiency scheme, propose new strategy extends also try construct feasible solutions information from computational evaluation publicly available instances with up 2530 54,731 tasks. It shows our outperforms previous methods problem respect both solution times RAM usage. A different acceleration important achieve these results. • MIP-CP hybrid an assignment Acceleration technique extending search solutions. Solve relaxation subproblems find stronger cuts. restriction Outperforms industrially relevant avionics

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Scheduling with Logic-Based Benders Decomposition

We study project scheduling at a large IT services delivery center in which there are unpredictable delays. We apply robust optimization to minimize tardiness while informing the customer of a reasonable worst-case completion time, based on empirically determined uncertainty sets. We introduce a new solution method based on logic-based Benders decomposition. We show that when the uncertainty se...

متن کامل

Logic-Based Benders Decomposition

Benders decomposition uses a strategy of “learning from one’s mistakes.” The aim of this paper is to extend this strategy to a much larger class of problems. The key is to generalize the linear programming dual used in the classical method to an “inference dual.” Solution of the inference dual takes the form of a logical deduction that yields Benders cuts. The dual is therefore very different f...

متن کامل

Single-facility scheduling by logic-based Benders decomposition

Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either method alone. We find that a similar technique can be beneficial for solving pure scheduling problems as the problem size scales up. We solve single-facility non-preemptive scheduling problems with time windows and long time horizon...

متن کامل

Planning and Scheduling by Logic-Based Benders Decomposition

We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve pro...

متن کامل

Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition

We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capacity constraints, and the allocation of the customers to trucks at those facilities under per truck traveldistance constraints. We present a hybrid approach that combines integer programming and constraint programming using logic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2022

ISSN: ['0305-0548', '1873-765X']

DOI: https://doi.org/10.1016/j.cor.2022.105916